[INFO] cloning repository https://github.com/rayniel95/rust-little-projects
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/rayniel95/rust-little-projects" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frayniel95%2Frust-little-projects", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frayniel95%2Frust-little-projects'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 493399f7480e34717d1db07e486cba226a9727a1
[INFO] testing rayniel95/rust-little-projects against try#b8e88e5ddf5521a9f43ee3f62a702388c713e4bb for pr-155114
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Frayniel95%2Frust-little-projects" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/rayniel95/rust-little-projects
[INFO] finished tweaking git repo https://github.com/rayniel95/rust-little-projects
[INFO] tweaked toml for git repo https://github.com/rayniel95/rust-little-projects written to /workspace/builds/worker-6-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/rayniel95/rust-little-projects on toolchain b8e88e5ddf5521a9f43ee3f62a702388c713e4bb
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/rayniel95/rust-little-projects already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded contracts v0.6.2
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] dee1589f2742abd6b8d41c40b6f0aa2eadfb22c9ee165d9dd8a4719ddbf8bb83
[INFO] running `Command { std: "docker" "start" "-a" "dee1589f2742abd6b8d41c40b6f0aa2eadfb22c9ee165d9dd8a4719ddbf8bb83", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "dee1589f2742abd6b8d41c40b6f0aa2eadfb22c9ee165d9dd8a4719ddbf8bb83", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "dee1589f2742abd6b8d41c40b6f0aa2eadfb22c9ee165d9dd8a4719ddbf8bb83", kill_on_drop: false }`
[INFO] [stdout] dee1589f2742abd6b8d41c40b6f0aa2eadfb22c9ee165d9dd8a4719ddbf8bb83
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] fbea813620985528878ba3f0577fee0a5844ca1977193ef9c6c9415860a48930
[INFO] running `Command { std: "docker" "start" "-a" "fbea813620985528878ba3f0577fee0a5844ca1977193ef9c6c9415860a48930", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.112
[INFO] [stderr]    Compiling syn v1.0.84
[INFO] [stderr]    Compiling ppv-lite86 v0.2.15
[INFO] [stderr]    Compiling getrandom v0.2.3
[INFO] [stderr]    Compiling rand_core v0.6.3
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling rand v0.8.4
[INFO] [stderr]    Compiling contracts v0.6.2
[INFO] [stderr]    Compiling rust-little-projects v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `super::linked_list::LinkedList`
[INFO] [stdout]  --> src/dsandalgo/linked_list/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::linked_list::LinkedList;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::linked_list::LinkedListError`
[INFO] [stdout]  --> src/dsandalgo/linked_list/test.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use super::linked_list::LinkedListError;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ptr::NonNull`
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:1:42
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull};
[INFO] [stdout]   |                                          ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::heap::HeapTree`
[INFO] [stdout]  --> src/dsandalgo/heap/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::heap::HeapTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rand::Rng`
[INFO] [stdout]  --> src/dsandalgo/heap/test.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use rand::Rng;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::iter::Inspect`
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::iter::Inspect;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::isAdmissibleOverpayment::solution`
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::isAdmissibleOverpayment::solution;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::linked_list_disjoint_set::DisjointSet`
[INFO] [stdout]  --> src/dsandalgo/linked_list_disjoint_set/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::linked_list_disjoint_set::DisjointSet;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rand::distributions::uniform::SampleBorrow`
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use rand::distributions::uniform::SampleBorrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:77:13
[INFO] [stdout]    |
[INFO] [stdout] 77 |         let mut pointer = Rc::clone(self);
[INFO] [stdout]    |             ----^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:87:13
[INFO] [stdout]    |
[INFO] [stdout] 87 |         let mut pointer = Rc::clone(self);
[INFO] [stdout]    |             ----^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:183:29
[INFO] [stdout]     |
[INFO] [stdout] 183 |                         let mut min: HeapPointer<T>;
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `LinkToNode` is never used
[INFO] [stdout]  --> src/dsandalgo/linked_list/linked_list.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type LinkToNode<T> = Rc<RefCell<LinkedNode<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `newLinkToNode` is never used
[INFO] [stdout]  --> src/dsandalgo/linked_list/linked_list.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn newLinkToNode<T>(value: T) -> LinkToNode<T>{
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedNode` is never constructed
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct LinkedNode<T>{
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl<T> LinkedNode<T>{
[INFO] [stdout]    | --------------------- associated function in this implementation
[INFO] [stdout] 18 |     fn new(value: T) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `LinkedListError` is never used
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub enum LinkedListError{
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedList` is never constructed
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub struct LinkedList<T>{
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:37:12
[INFO] [stdout]     |
[INFO] [stdout]  36 | impl<T> LinkedList<T>{
[INFO] [stdout]     | --------------------- associated items in this implementation
[INFO] [stdout]  37 |     pub fn new() -> Self{
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  45 |     pub fn count(&self) -> u32{
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  49 |     pub fn add_last(& mut self, value: T){
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  65 |     pub fn pop_first(& mut self) -> Result<T, LinkedListError>{
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  85 |     pub fn add_first(& mut self, value: T){
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  99 |     pub fn pop_last(& mut self) -> Result<T, LinkedListError>{
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<T>>{
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<T>>{
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `HeapPointer` is never used
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:7:6
[INFO] [stdout]   |
[INFO] [stdout] 7 | type HeapPointer<T> = Rc<RefCell<Heap<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `LinkedNodePointer` is never used
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:8:6
[INFO] [stdout]   |
[INFO] [stdout] 8 | type LinkedNodePointer<T> = Rc<RefCell<LinkedNode<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `HeapWeakPointer` is never used
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:9:6
[INFO] [stdout]   |
[INFO] [stdout] 9 | type HeapWeakPointer<T> = Weak<RefCell<Heap<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `LinkedNodeWeakPointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:10:6
[INFO] [stdout]    |
[INFO] [stdout] 10 | type LinkedNodeWeakPointer<T> = Weak<RefCell<LinkedNode<T>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `OptionalLinkedNodePointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | type OptionalLinkedNodePointer<T> = Option<LinkedNodePointer<T>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `OptionalHeapPointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:12:6
[INFO] [stdout]    |
[INFO] [stdout] 12 | type OptionalHeapPointer<T> = Option<HeapPointer<T>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `Heapable` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:14:7
[INFO] [stdout]    |
[INFO] [stdout] 14 | trait Heapable<T> where Self: Sized {
[INFO] [stdout]    |       ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Cell` is never constructed
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:98:8
[INFO] [stdout]    |
[INFO] [stdout] 98 | struct Cell<T>{
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedNode` is never constructed
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 103 | struct LinkedNode<T>{
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `HeapTree` is never constructed
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:109:12
[INFO] [stdout]     |
[INFO] [stdout] 109 | pub struct HeapTree<T>{
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Heap` is never constructed
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:116:19
[INFO] [stdout]     |
[INFO] [stdout] 116 | pub(crate) struct Heap<T>{
[INFO] [stdout]     |                   ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:202:8
[INFO] [stdout]     |
[INFO] [stdout] 201 | impl<T> LinkedNode<T> {
[INFO] [stdout]     | --------------------- associated function in this implementation
[INFO] [stdout] 202 |     fn new(heap: HeapPointer<T>)->LinkedNode<T>{
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `LinkedNodable` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:211:7
[INFO] [stdout]     |
[INFO] [stdout] 211 | trait LinkedNodable<T> where Self: Sized{
[INFO] [stdout]     |       ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_heap_structure_and_reachability` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:446:19
[INFO] [stdout]     |
[INFO] [stdout] 446 |     pub(super) fn test_heap_structure_and_reachability<T>(heap: &HeapPointer<T>) -> i32{
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_heap_partial_ordering` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:476:19
[INFO] [stdout]     |
[INFO] [stdout] 476 |     pub(super) fn test_heap_partial_ordering<T>(heap: &HeapPointer<T>) -> bool{
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solution` is never used
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solution(prices: Vec<f64>, notes: Vec<String>, x: f64) -> bool {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `SetLink` is never used
[INFO] [stdout]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type SetLink = Rc<RefCell<Set>>;
[INFO] [stdout]   |      ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `DisjointSetable` is never used
[INFO] [stdout]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | trait DisjointSetable {
[INFO] [stdout]   |       ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Set` is never constructed
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub struct Set{
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | impl Set{
[INFO] [stdout]    | -------- associated function in this implementation
[INFO] [stdout] 45 |     fn new(index: u32)-> Self{
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DisjointSet` is never constructed
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub struct DisjointSet{
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_set`, and `merge` are never used
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12
[INFO] [stdout]    |
[INFO] [stdout] 64 | impl  DisjointSet{
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 65 |     pub fn new(size: u32)->Self{
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn find_set(& mut self, index: usize)->u32{
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 75 |     pub fn merge(&self, index1: usize, index2: usize){
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `SetLink` is never used
[INFO] [stdout]  --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type SetLink = Rc<RefCell<NodeSet>>;
[INFO] [stdout]   |      ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NodeSet` is never constructed
[INFO] [stdout]  --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct NodeSet {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl NodeSet {
[INFO] [stdout]    | ------------ associated function in this implementation
[INFO] [stdout] 13 |     fn new(index: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DisjointSet` is never constructed
[INFO] [stdout]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub struct DisjointSet {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_set`, `merge`, and `insert` are never used
[INFO] [stdout]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl DisjointSet {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 28 |     pub fn new(lenght: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn find_set(&self, index: usize) -> usize {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     pub fn merge(&self, index1: usize, index2: usize) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     fn insert(&self, one: usize, two: usize) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/mod.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | mod isAdmissibleOverpayment;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `newLinkToNode` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/linked_list/linked_list.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn newLinkToNode<T>(value: T) -> LinkToNode<T>{
[INFO] [stdout]   |    ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:132:23
[INFO] [stdout]     |
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<T>>{
[INFO] [stdout]     |                       ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                       |
[INFO] [stdout]     |                       the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<'_, T>>{
[INFO] [stdout]     |                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:140:22
[INFO] [stdout]     |
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<T>>{
[INFO] [stdout]     |                      ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                      |
[INFO] [stdout]     |                      the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<'_, T>>{
[INFO] [stdout]     |                                         +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: structure field `parentOfLast` should have a snake case name
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:112:5
[INFO] [stdout]     |
[INFO] [stdout] 112 |     parentOfLast: Option<LinkedNodeWeakPointer<T>>,
[INFO] [stdout]     |     ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | mod isAdmissibleOverpayment;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 6.99s
[INFO] running `Command { std: "docker" "inspect" "fbea813620985528878ba3f0577fee0a5844ca1977193ef9c6c9415860a48930", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "fbea813620985528878ba3f0577fee0a5844ca1977193ef9c6c9415860a48930", kill_on_drop: false }`
[INFO] [stdout] fbea813620985528878ba3f0577fee0a5844ca1977193ef9c6c9415860a48930
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 9a6f879b5775916cd3e19b7bf952e69d8850e7716073e052fedd6ff0e33dfde7
[INFO] running `Command { std: "docker" "start" "-a" "9a6f879b5775916cd3e19b7bf952e69d8850e7716073e052fedd6ff0e33dfde7", kill_on_drop: false }`
[INFO] [stdout] warning: unused import: `super::linked_list::LinkedList`
[INFO] [stdout]  --> src/dsandalgo/linked_list/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::linked_list::LinkedList;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::linked_list::LinkedListError`
[INFO] [stdout]  --> src/dsandalgo/linked_list/test.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use super::linked_list::LinkedListError;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ptr::NonNull`
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:1:42
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull};
[INFO] [stdout]   |                                          ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::heap::HeapTree`
[INFO] [stdout]  --> src/dsandalgo/heap/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::heap::HeapTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rand::Rng`
[INFO] [stdout]  --> src/dsandalgo/heap/test.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use rand::Rng;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::iter::Inspect`
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::iter::Inspect;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::isAdmissibleOverpayment::solution`
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::isAdmissibleOverpayment::solution;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::linked_list_disjoint_set::DisjointSet`
[INFO] [stdout]  --> src/dsandalgo/linked_list_disjoint_set/test.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use super::linked_list_disjoint_set::DisjointSet;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rand::distributions::uniform::SampleBorrow`
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use rand::distributions::uniform::SampleBorrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:77:13
[INFO] [stdout]    |
[INFO] [stdout] 77 |         let mut pointer = Rc::clone(self);
[INFO] [stdout]    |             ----^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:87:13
[INFO] [stdout]    |
[INFO] [stdout] 87 |         let mut pointer = Rc::clone(self);
[INFO] [stdout]    |             ----^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:183:29
[INFO] [stdout]     |
[INFO] [stdout] 183 |                         let mut min: HeapPointer<T>;
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `LinkToNode` is never used
[INFO] [stdout]  --> src/dsandalgo/linked_list/linked_list.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type LinkToNode<T> = Rc<RefCell<LinkedNode<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `newLinkToNode` is never used
[INFO] [stdout]  --> src/dsandalgo/linked_list/linked_list.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn newLinkToNode<T>(value: T) -> LinkToNode<T>{
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedNode` is never constructed
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct LinkedNode<T>{
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl<T> LinkedNode<T>{
[INFO] [stdout]    | --------------------- associated function in this implementation
[INFO] [stdout] 18 |     fn new(value: T) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `LinkedListError` is never used
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub enum LinkedListError{
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedList` is never constructed
[INFO] [stdout]   --> src/dsandalgo/linked_list/linked_list.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub struct LinkedList<T>{
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:37:12
[INFO] [stdout]     |
[INFO] [stdout]  36 | impl<T> LinkedList<T>{
[INFO] [stdout]     | --------------------- associated items in this implementation
[INFO] [stdout]  37 |     pub fn new() -> Self{
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  45 |     pub fn count(&self) -> u32{
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  49 |     pub fn add_last(& mut self, value: T){
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  65 |     pub fn pop_first(& mut self) -> Result<T, LinkedListError>{
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  85 |     pub fn add_first(& mut self, value: T){
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  99 |     pub fn pop_last(& mut self) -> Result<T, LinkedListError>{
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<T>>{
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<T>>{
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `HeapPointer` is never used
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:7:6
[INFO] [stdout]   |
[INFO] [stdout] 7 | type HeapPointer<T> = Rc<RefCell<Heap<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `LinkedNodePointer` is never used
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:8:6
[INFO] [stdout]   |
[INFO] [stdout] 8 | type LinkedNodePointer<T> = Rc<RefCell<LinkedNode<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `HeapWeakPointer` is never used
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:9:6
[INFO] [stdout]   |
[INFO] [stdout] 9 | type HeapWeakPointer<T> = Weak<RefCell<Heap<T>>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `LinkedNodeWeakPointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:10:6
[INFO] [stdout]    |
[INFO] [stdout] 10 | type LinkedNodeWeakPointer<T> = Weak<RefCell<LinkedNode<T>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `OptionalLinkedNodePointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | type OptionalLinkedNodePointer<T> = Option<LinkedNodePointer<T>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `OptionalHeapPointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:12:6
[INFO] [stdout]    |
[INFO] [stdout] 12 | type OptionalHeapPointer<T> = Option<HeapPointer<T>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `Heapable` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:14:7
[INFO] [stdout]    |
[INFO] [stdout] 14 | trait Heapable<T> where Self: Sized {
[INFO] [stdout]    |       ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Cell` is never constructed
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:98:8
[INFO] [stdout]    |
[INFO] [stdout] 98 | struct Cell<T>{
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedNode` is never constructed
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 103 | struct LinkedNode<T>{
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `HeapTree` is never constructed
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:109:12
[INFO] [stdout]     |
[INFO] [stdout] 109 | pub struct HeapTree<T>{
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Heap` is never constructed
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:116:19
[INFO] [stdout]     |
[INFO] [stdout] 116 | pub(crate) struct Heap<T>{
[INFO] [stdout]     |                   ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:202:8
[INFO] [stdout]     |
[INFO] [stdout] 201 | impl<T> LinkedNode<T> {
[INFO] [stdout]     | --------------------- associated function in this implementation
[INFO] [stdout] 202 |     fn new(heap: HeapPointer<T>)->LinkedNode<T>{
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling rust-little-projects v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: trait `LinkedNodable` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:211:7
[INFO] [stdout]     |
[INFO] [stdout] 211 | trait LinkedNodable<T> where Self: Sized{
[INFO] [stdout]     |       ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_heap_structure_and_reachability` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:446:19
[INFO] [stdout]     |
[INFO] [stdout] 446 |     pub(super) fn test_heap_structure_and_reachability<T>(heap: &HeapPointer<T>) -> i32{
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_heap_partial_ordering` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:476:19
[INFO] [stdout]     |
[INFO] [stdout] 476 |     pub(super) fn test_heap_partial_ordering<T>(heap: &HeapPointer<T>) -> bool{
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solution` is never used
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solution(prices: Vec<f64>, notes: Vec<String>, x: f64) -> bool {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `SetLink` is never used
[INFO] [stdout]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type SetLink = Rc<RefCell<Set>>;
[INFO] [stdout]   |      ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `DisjointSetable` is never used
[INFO] [stdout]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | trait DisjointSetable {
[INFO] [stdout]   |       ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Set` is never constructed
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub struct Set{
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | impl Set{
[INFO] [stdout]    | -------- associated function in this implementation
[INFO] [stdout] 45 |     fn new(index: u32)-> Self{
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DisjointSet` is never constructed
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub struct DisjointSet{
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_set`, and `merge` are never used
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12
[INFO] [stdout]    |
[INFO] [stdout] 64 | impl  DisjointSet{
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 65 |     pub fn new(size: u32)->Self{
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn find_set(& mut self, index: usize)->u32{
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 75 |     pub fn merge(&self, index1: usize, index2: usize){
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `SetLink` is never used
[INFO] [stdout]  --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type SetLink = Rc<RefCell<NodeSet>>;
[INFO] [stdout]   |      ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NodeSet` is never constructed
[INFO] [stdout]  --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | struct NodeSet {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl NodeSet {
[INFO] [stdout]    | ------------ associated function in this implementation
[INFO] [stdout] 13 |     fn new(index: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DisjointSet` is never constructed
[INFO] [stdout]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub struct DisjointSet {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_set`, `merge`, and `insert` are never used
[INFO] [stdout]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl DisjointSet {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 28 |     pub fn new(lenght: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn find_set(&self, index: usize) -> usize {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     pub fn merge(&self, index1: usize, index2: usize) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     fn insert(&self, one: usize, two: usize) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/mod.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | mod isAdmissibleOverpayment;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `newLinkToNode` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/linked_list/linked_list.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn newLinkToNode<T>(value: T) -> LinkToNode<T>{
[INFO] [stdout]   |    ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:132:23
[INFO] [stdout]     |
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<T>>{
[INFO] [stdout]     |                       ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                       |
[INFO] [stdout]     |                       the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<'_, T>>{
[INFO] [stdout]     |                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:140:22
[INFO] [stdout]     |
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<T>>{
[INFO] [stdout]     |                      ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                      |
[INFO] [stdout]     |                      the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<'_, T>>{
[INFO] [stdout]     |                                         +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: structure field `parentOfLast` should have a snake case name
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:112:5
[INFO] [stdout]     |
[INFO] [stdout] 112 |     parentOfLast: Option<LinkedNodeWeakPointer<T>>,
[INFO] [stdout]     |     ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | mod isAdmissibleOverpayment;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::linked_list::LinkedListError`
[INFO] [stdout]  --> src/dsandalgo/linked_list/test.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use super::linked_list::LinkedListError;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ptr::NonNull`
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:1:42
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull};
[INFO] [stdout]   |                                          ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> src/dsandalgo/heap/test.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |     use core::num;
[INFO] [stdout]   |         ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `cmp::Ordering` and `vec`
[INFO] [stdout]  --> src/dsandalgo/heap/test.rs:7:15
[INFO] [stdout]   |
[INFO] [stdout] 7 |     use std::{cmp::Ordering, vec};
[INFO] [stdout]   |               ^^^^^^^^^^^^^  ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::iter::Inspect`
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::iter::Inspect;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `cmp::Ordering` and `convert::TryInto`
[INFO] [stdout]  --> src/dsandalgo/linked_list_disjoint_set/test.rs:5:15
[INFO] [stdout]   |
[INFO] [stdout] 5 |     use std::{cmp::Ordering, convert::TryInto, vec};
[INFO] [stdout]   |               ^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `rand::distributions::uniform::SampleBorrow`
[INFO] [stdout]  --> src/dsandalgo/heap/heap.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use rand::distributions::uniform::SampleBorrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:77:13
[INFO] [stdout]    |
[INFO] [stdout] 77 |         let mut pointer = Rc::clone(self);
[INFO] [stdout]    |             ----^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:87:13
[INFO] [stdout]    |
[INFO] [stdout] 87 |         let mut pointer = Rc::clone(self);
[INFO] [stdout]    |             ----^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:183:29
[INFO] [stdout]     |
[INFO] [stdout] 183 |                         let mut min: HeapPointer<T>;
[INFO] [stdout]     |                             ----^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/dsandalgo/heap/test.rs:23:17
[INFO] [stdout]    |
[INFO] [stdout] 23 |             let mut new_min = my_heap.pop().unwrap();
[INFO] [stdout]    |                 ----^^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `OptionalLinkedNodePointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | type OptionalLinkedNodePointer<T> = Option<LinkedNodePointer<T>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `OptionalHeapPointer` is never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:12:6
[INFO] [stdout]    |
[INFO] [stdout] 12 | type OptionalHeapPointer<T> = Option<HeapPointer<T>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `has_left_child` and `is_right_child` are never used
[INFO] [stdout]   --> src/dsandalgo/heap/heap.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | trait Heapable<T> where Self: Sized {
[INFO] [stdout]    |       -------- methods in this trait
[INFO] [stdout] 15 |     fn has_left_child(&self)->bool;
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn is_right_child(&self, other: &Self)->bool;
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_heap_structure_and_reachability` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:446:19
[INFO] [stdout]     |
[INFO] [stdout] 446 |     pub(super) fn test_heap_structure_and_reachability<T>(heap: &HeapPointer<T>) -> i32{
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `test_heap_partial_ordering` is never used
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:476:19
[INFO] [stdout]     |
[INFO] [stdout] 476 |     pub(super) fn test_heap_partial_ordering<T>(heap: &HeapPointer<T>) -> bool{
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `SetLink` is never used
[INFO] [stdout]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type SetLink = Rc<RefCell<Set>>;
[INFO] [stdout]   |      ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `DisjointSetable` is never used
[INFO] [stdout]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | trait DisjointSetable {
[INFO] [stdout]   |       ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Set` is never constructed
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub struct Set{
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | impl Set{
[INFO] [stdout]    | -------- associated function in this implementation
[INFO] [stdout] 45 |     fn new(index: u32)-> Self{
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DisjointSet` is never constructed
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub struct DisjointSet{
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_set`, and `merge` are never used
[INFO] [stdout]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12
[INFO] [stdout]    |
[INFO] [stdout] 64 | impl  DisjointSet{
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 65 |     pub fn new(size: u32)->Self{
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     pub fn find_set(& mut self, index: usize)->u32{
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 75 |     pub fn merge(&self, index1: usize, index2: usize){
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/mod.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | mod isAdmissibleOverpayment;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `newLinkToNode` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/linked_list/linked_list.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn newLinkToNode<T>(value: T) -> LinkToNode<T>{
[INFO] [stdout]   |    ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:132:23
[INFO] [stdout]     |
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<T>>{
[INFO] [stdout]     |                       ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                       |
[INFO] [stdout]     |                       the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 132 |     pub fn peek_first(&self)->Option<Ref<'_, T>>{
[INFO] [stdout]     |                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/dsandalgo/linked_list/linked_list.rs:140:22
[INFO] [stdout]     |
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<T>>{
[INFO] [stdout]     |                      ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                      |
[INFO] [stdout]     |                      the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 140 |     pub fn peek_last(&self)->Option<Ref<'_, T>>{
[INFO] [stdout]     |                                         +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `Result` that must be used
[INFO] [stdout]   --> src/dsandalgo/linked_list/test.rs:60:13
[INFO] [stdout]    |
[INFO] [stdout] 60 |             list.pop_first();
[INFO] [stdout]    |             ^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout]    = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]    |
[INFO] [stdout] 60 |             let _ = list.pop_first();
[INFO] [stdout]    |             +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `Result` that must be used
[INFO] [stdout]    --> src/dsandalgo/linked_list/test.rs:113:13
[INFO] [stdout]     |
[INFO] [stdout] 113 |             list.pop_last();
[INFO] [stdout]     |             ^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 113 |             let _ = list.pop_last();
[INFO] [stdout]     |             +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: structure field `parentOfLast` should have a snake case name
[INFO] [stdout]    --> src/dsandalgo/heap/heap.rs:112:5
[INFO] [stdout]     |
[INFO] [stdout] 112 |     parentOfLast: Option<LinkedNodeWeakPointer<T>>,
[INFO] [stdout]     |     ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stdout]  --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | mod isAdmissibleOverpayment;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.85s
[INFO] running `Command { std: "docker" "inspect" "9a6f879b5775916cd3e19b7bf952e69d8850e7716073e052fedd6ff0e33dfde7", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "9a6f879b5775916cd3e19b7bf952e69d8850e7716073e052fedd6ff0e33dfde7", kill_on_drop: false }`
[INFO] [stdout] 9a6f879b5775916cd3e19b7bf952e69d8850e7716073e052fedd6ff0e33dfde7
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+b8e88e5ddf5521a9f43ee3f62a702388c713e4bb" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] e512f56d8af9f5f7ea4e2ec7558971863b3d7e2a2bb8798302009c7cc4f78f32
[INFO] running `Command { std: "docker" "start" "-a" "e512f56d8af9f5f7ea4e2ec7558971863b3d7e2a2bb8798302009c7cc4f78f32", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `super::linked_list::LinkedList`
[INFO] [stderr]  --> src/dsandalgo/linked_list/test.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use super::linked_list::LinkedList;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::linked_list::LinkedListError`
[INFO] [stderr]  --> src/dsandalgo/linked_list/test.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use super::linked_list::LinkedListError;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `ptr::NonNull`
[INFO] [stderr]  --> src/dsandalgo/heap/heap.rs:1:42
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{rc::{Rc, Weak}, cell::RefCell, ptr::NonNull};
[INFO] [stderr]   |                                          ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::heap::HeapTree`
[INFO] [stderr]  --> src/dsandalgo/heap/test.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use super::heap::HeapTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `rand::Rng`
[INFO] [stderr]  --> src/dsandalgo/heap/test.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use rand::Rng;
[INFO] [stderr]   |     ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::iter::Inspect`
[INFO] [stderr]  --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::iter::Inspect;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::isAdmissibleOverpayment::solution`
[INFO] [stderr]  --> src/dsandalgo/isAdmissibleOverpayment/test.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use super::isAdmissibleOverpayment::solution;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::linked_list_disjoint_set::DisjointSet`
[INFO] [stderr]  --> src/dsandalgo/linked_list_disjoint_set/test.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use super::linked_list_disjoint_set::DisjointSet;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `rand::distributions::uniform::SampleBorrow`
[INFO] [stderr]  --> src/dsandalgo/heap/heap.rs:5:5
[INFO] [stderr]   |
[INFO] [stderr] 5 | use rand::distributions::uniform::SampleBorrow;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:77:13
[INFO] [stderr]    |
[INFO] [stderr] 77 |         let mut pointer = Rc::clone(self);
[INFO] [stderr]    |             ----^^^^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:87:13
[INFO] [stderr]    |
[INFO] [stderr] 87 |         let mut pointer = Rc::clone(self);
[INFO] [stderr]    |             ----^^^^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:183:29
[INFO] [stderr]     |
[INFO] [stderr] 183 |                         let mut min: HeapPointer<T>;
[INFO] [stderr]     |                             ----^^^
[INFO] [stderr]     |                             |
[INFO] [stderr]     |                             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `LinkToNode` is never used
[INFO] [stderr]  --> src/dsandalgo/linked_list/linked_list.rs:5:6
[INFO] [stderr]   |
[INFO] [stderr] 5 | type LinkToNode<T> = Rc<RefCell<LinkedNode<T>>>;
[INFO] [stderr]   |      ^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `newLinkToNode` is never used
[INFO] [stderr]  --> src/dsandalgo/linked_list/linked_list.rs:7:4
[INFO] [stderr]   |
[INFO] [stderr] 7 | fn newLinkToNode<T>(value: T) -> LinkToNode<T>{
[INFO] [stderr]   |    ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `LinkedNode` is never constructed
[INFO] [stderr]   --> src/dsandalgo/linked_list/linked_list.rs:12:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | struct LinkedNode<T>{
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/dsandalgo/linked_list/linked_list.rs:18:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | impl<T> LinkedNode<T>{
[INFO] [stderr]    | --------------------- associated function in this implementation
[INFO] [stderr] 18 |     fn new(value: T) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: enum `LinkedListError` is never used
[INFO] [stderr]   --> src/dsandalgo/linked_list/linked_list.rs:26:10
[INFO] [stderr]    |
[INFO] [stderr] 26 | pub enum LinkedListError{
[INFO] [stderr]    |          ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `LinkedList` is never constructed
[INFO] [stderr]   --> src/dsandalgo/linked_list/linked_list.rs:30:12
[INFO] [stderr]    |
[INFO] [stderr] 30 | pub struct LinkedList<T>{
[INFO] [stderr]    |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: multiple associated items are never used
[INFO] [stderr]    --> src/dsandalgo/linked_list/linked_list.rs:37:12
[INFO] [stderr]     |
[INFO] [stderr]  36 | impl<T> LinkedList<T>{
[INFO] [stderr]     | --------------------- associated items in this implementation
[INFO] [stderr]  37 |     pub fn new() -> Self{
[INFO] [stderr]     |            ^^^
[INFO] [stderr] ...
[INFO] [stderr]  45 |     pub fn count(&self) -> u32{
[INFO] [stderr]     |            ^^^^^
[INFO] [stderr] ...
[INFO] [stderr]  49 |     pub fn add_last(& mut self, value: T){
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr]  65 |     pub fn pop_first(& mut self) -> Result<T, LinkedListError>{
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr]  85 |     pub fn add_first(& mut self, value: T){
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr]  99 |     pub fn pop_last(& mut self) -> Result<T, LinkedListError>{
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 132 |     pub fn peek_first(&self)->Option<Ref<T>>{
[INFO] [stderr]     |            ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 140 |     pub fn peek_last(&self)->Option<Ref<T>>{
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `HeapPointer` is never used
[INFO] [stderr]  --> src/dsandalgo/heap/heap.rs:7:6
[INFO] [stderr]   |
[INFO] [stderr] 7 | type HeapPointer<T> = Rc<RefCell<Heap<T>>>;
[INFO] [stderr]   |      ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `LinkedNodePointer` is never used
[INFO] [stderr]  --> src/dsandalgo/heap/heap.rs:8:6
[INFO] [stderr]   |
[INFO] [stderr] 8 | type LinkedNodePointer<T> = Rc<RefCell<LinkedNode<T>>>;
[INFO] [stderr]   |      ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `HeapWeakPointer` is never used
[INFO] [stderr]  --> src/dsandalgo/heap/heap.rs:9:6
[INFO] [stderr]   |
[INFO] [stderr] 9 | type HeapWeakPointer<T> = Weak<RefCell<Heap<T>>>;
[INFO] [stderr]   |      ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `LinkedNodeWeakPointer` is never used
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:10:6
[INFO] [stderr]    |
[INFO] [stderr] 10 | type LinkedNodeWeakPointer<T> = Weak<RefCell<LinkedNode<T>>>;
[INFO] [stderr]    |      ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `OptionalLinkedNodePointer` is never used
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:11:6
[INFO] [stderr]    |
[INFO] [stderr] 11 | type OptionalLinkedNodePointer<T> = Option<LinkedNodePointer<T>>;
[INFO] [stderr]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `OptionalHeapPointer` is never used
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:12:6
[INFO] [stderr]    |
[INFO] [stderr] 12 | type OptionalHeapPointer<T> = Option<HeapPointer<T>>;
[INFO] [stderr]    |      ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `Heapable` is never used
[INFO] [stdout] 
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:14:7
[INFO] [stdout] running 20 tests
[INFO] [stderr]    |
[INFO] [stderr] 14 | trait Heapable<T> where Self: Sized {
[INFO] [stderr]    |       ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Cell` is never constructed
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:98:8
[INFO] [stderr]    |
[INFO] [stderr] 98 | struct Cell<T>{
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `LinkedNode` is never constructed
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:103:8
[INFO] [stderr]     |
[INFO] [stderr] 103 | struct LinkedNode<T>{
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test2 ... ok
[INFO] [stderr] 
[INFO] [stderr] warning: struct `HeapTree` is never constructed
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:109:12
[INFO] [stderr]     |
[INFO] [stderr] 109 | pub struct HeapTree<T>{
[INFO] [stderr]     |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Heap` is never constructed
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:116:19
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test3 ... ok
[INFO] [stderr]     |
[INFO] [stderr] 116 | pub(crate) struct Heap<T>{
[INFO] [stderr]     |                   ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:202:8
[INFO] [stderr]     |
[INFO] [stderr] 201 | impl<T> LinkedNode<T> {
[INFO] [stderr]     | --------------------- associated function in this implementation
[INFO] [stderr] 202 |     fn new(heap: HeapPointer<T>)->LinkedNode<T>{
[INFO] [stderr]     |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `LinkedNodable` is never used
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:211:7
[INFO] [stderr]     |
[INFO] [stderr] 211 | trait LinkedNodable<T> where Self: Sized{
[INFO] [stderr]     |       ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `test_heap_structure_and_reachability` is never used
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:446:19
[INFO] [stderr]     |
[INFO] [stderr] 446 |     pub(super) fn test_heap_structure_and_reachability<T>(heap: &HeapPointer<T>) -> i32{
[INFO] [stderr]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `test_heap_partial_ordering` is never used
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:476:19
[INFO] [stderr]     |
[INFO] [stderr] 476 |     pub(super) fn test_heap_partial_ordering<T>(heap: &HeapPointer<T>) -> bool{
[INFO] [stderr]     |                   ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `solution` is never used
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test4 ... ok
[INFO] [stderr]  --> src/dsandalgo/isAdmissibleOverpayment/isAdmissibleOverpayment.rs:3:8
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test8 ... ok
[INFO] [stderr]   |
[INFO] [stdout] test dsandalgo::linked_list::test::test::add_first_test ... ok
[INFO] [stderr] 3 | pub fn solution(prices: Vec<f64>, notes: Vec<String>, x: f64) -> bool {
[INFO] [stdout] test dsandalgo::linked_list::test::test::add_last_and_count_test ... ok
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stdout] test dsandalgo::linked_list::test::test::extend_test ... ok
[INFO] [stderr] 
[INFO] [stdout] test dsandalgo::linked_list::test::test::iterator_test ... ok
[INFO] [stderr] warning: type alias `SetLink` is never used
[INFO] [stdout] test dsandalgo::linked_list::test::test::peek_first_test ... ok
[INFO] [stderr]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:4:6
[INFO] [stdout] test dsandalgo::linked_list::test::test::peek_last_test ... ok
[INFO] [stderr]   |
[INFO] [stdout] test dsandalgo::linked_list::test::test::pop_first_test ... ok
[INFO] [stderr] 4 | type SetLink = Rc<RefCell<Set>>;
[INFO] [stdout] test dsandalgo::linked_list::test::test::pop_last_test ... ok
[INFO] [stderr]   |      ^^^^^^^
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test9 ... ok
[INFO] [stderr] 
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test10 ... ok
[INFO] [stderr] warning: trait `DisjointSetable` is never used
[INFO] [stderr]  --> src/dsandalgo/disjoint_set/disjoint_set.rs:6:7
[INFO] [stderr]   |
[INFO] [stderr] 6 | trait DisjointSetable {
[INFO] [stderr]   |       ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Set` is never constructed
[INFO] [stderr]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:38:12
[INFO] [stderr]    |
[INFO] [stderr] 38 | pub struct Set{
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:45:8
[INFO] [stderr]    |
[INFO] [stderr] 44 | impl Set{
[INFO] [stderr]    | -------- associated function in this implementation
[INFO] [stderr] 45 |     fn new(index: u32)-> Self{
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `DisjointSet` is never constructed
[INFO] [stderr]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:60:12
[INFO] [stderr]    |
[INFO] [stderr] 60 | pub struct DisjointSet{
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `find_set`, and `merge` are never used
[INFO] [stderr]   --> src/dsandalgo/disjoint_set/disjoint_set.rs:65:12
[INFO] [stderr]    |
[INFO] [stderr] 64 | impl  DisjointSet{
[INFO] [stderr]    | ----------------- associated items in this implementation
[INFO] [stderr] 65 |     pub fn new(size: u32)->Self{
[INFO] [stderr]    |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 72 |     pub fn find_set(& mut self, index: usize)->u32{
[INFO] [stderr]    |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 75 |     pub fn merge(&self, index1: usize, index2: usize){
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `SetLink` is never used
[INFO] [stderr]  --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:3:6
[INFO] [stderr]   |
[INFO] [stderr] 3 | type SetLink = Rc<RefCell<NodeSet>>;
[INFO] [stderr]   |      ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `NodeSet` is never constructed
[INFO] [stderr]  --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | struct NodeSet {
[INFO] [stderr]   |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | impl NodeSet {
[INFO] [stderr]    | ------------ associated function in this implementation
[INFO] [stderr] 13 |     fn new(index: usize) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `DisjointSet` is never constructed
[INFO] [stderr]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:23:12
[INFO] [stderr]    |
[INFO] [stderr] 23 | pub struct DisjointSet {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `find_set`, `merge`, and `insert` are never used
[INFO] [stderr]   --> src/dsandalgo/linked_list_disjoint_set/linked_list_disjoint_set.rs:28:12
[INFO] [stderr]    |
[INFO] [stderr] 27 | impl DisjointSet {
[INFO] [stderr]    | ---------------- associated items in this implementation
[INFO] [stderr] 28 |     pub fn new(lenght: usize) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 36 |     pub fn find_set(&self, index: usize) -> usize {
[INFO] [stderr]    |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45 |     pub fn merge(&self, index1: usize, index2: usize) {
[INFO] [stderr]    |            ^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 64 |     fn insert(&self, one: usize, two: usize) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stderr]  --> src/dsandalgo/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 | mod isAdmissibleOverpayment;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `newLinkToNode` should have a snake case name
[INFO] [stderr]  --> src/dsandalgo/linked_list/linked_list.rs:7:4
[INFO] [stderr]   |
[INFO] [stderr] 7 | fn newLinkToNode<T>(value: T) -> LinkToNode<T>{
[INFO] [stderr]   |    ^^^^^^^^^^^^^ help: convert the identifier to snake case: `new_link_to_node`
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/dsandalgo/linked_list/linked_list.rs:132:23
[INFO] [stderr]     |
[INFO] [stderr] 132 |     pub fn peek_first(&self)->Option<Ref<T>>{
[INFO] [stderr]     |                       ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                       |
[INFO] [stderr]     |                       the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 132 |     pub fn peek_first(&self)->Option<Ref<'_, T>>{
[INFO] [stderr]     |                                          +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/dsandalgo/linked_list/linked_list.rs:140:22
[INFO] [stderr]     |
[INFO] [stderr] 140 |     pub fn peek_last(&self)->Option<Ref<T>>{
[INFO] [stderr]     |                      ^^^^^          ^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                      |
[INFO] [stderr]     |                      the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 140 |     pub fn peek_last(&self)->Option<Ref<'_, T>>{
[INFO] [stderr]     |                                         +++
[INFO] [stderr] 
[INFO] [stderr] warning: structure field `parentOfLast` should have a snake case name
[INFO] [stderr]    --> src/dsandalgo/heap/heap.rs:112:5
[INFO] [stderr]     |
[INFO] [stderr] 112 |     parentOfLast: Option<LinkedNodeWeakPointer<T>>,
[INFO] [stderr]     |     ^^^^^^^^^^^^ help: convert the identifier to snake case: `parent_of_last`
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test7 ... ok
[INFO] [stderr] 
[INFO] [stderr] warning: module `isAdmissibleOverpayment` should have a snake case name
[INFO] [stderr]  --> src/dsandalgo/isAdmissibleOverpayment/mod.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | mod isAdmissibleOverpayment;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `is_admissible_overpayment`
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::linked_list::LinkedListError`
[INFO] [stderr]  --> src/dsandalgo/linked_list/test.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use super::linked_list::LinkedListError;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `core::num`
[INFO] [stderr]  --> src/dsandalgo/heap/test.rs:6:9
[INFO] [stderr]   |
[INFO] [stderr] 6 |     use core::num;
[INFO] [stderr]   |         ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `cmp::Ordering` and `vec`
[INFO] [stderr]  --> src/dsandalgo/heap/test.rs:7:15
[INFO] [stderr]   |
[INFO] [stderr] 7 |     use std::{cmp::Ordering, vec};
[INFO] [stderr]   |               ^^^^^^^^^^^^^  ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `cmp::Ordering` and `convert::TryInto`
[INFO] [stderr]  --> src/dsandalgo/linked_list_disjoint_set/test.rs:5:15
[INFO] [stderr]   |
[INFO] [stderr] 5 |     use std::{cmp::Ordering, convert::TryInto, vec};
[INFO] [stderr]   |               ^^^^^^^^^^^^^  ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/dsandalgo/heap/test.rs:23:17
[INFO] [stderr]    |
[INFO] [stderr] 23 |             let mut new_min = my_heap.pop().unwrap();
[INFO] [stderr]    |                 ----^^^^^^^
[INFO] [stderr]    |                 |
[INFO] [stderr]    |                 help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `OptionalLinkedNodePointer` is never used
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:11:6
[INFO] [stderr]    |
[INFO] [stderr] 11 | type OptionalLinkedNodePointer<T> = Option<LinkedNodePointer<T>>;
[INFO] [stderr]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: methods `has_left_child` and `is_right_child` are never used
[INFO] [stderr]   --> src/dsandalgo/heap/heap.rs:15:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | trait Heapable<T> where Self: Sized {
[INFO] [stderr]    |       -------- methods in this trait
[INFO] [stderr] 15 |     fn has_left_child(&self)->bool;
[INFO] [stderr]    |        ^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 21 |     fn is_right_child(&self, other: &Self)->bool;
[INFO] [stderr]    |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused `Result` that must be used
[INFO] [stderr]   --> src/dsandalgo/linked_list/test.rs:60:13
[INFO] [stderr]    |
[INFO] [stderr] 60 |             list.pop_first();
[INFO] [stderr]    |             ^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stderr]    = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]    |
[INFO] [stderr] 60 |             let _ = list.pop_first();
[INFO] [stderr]    |             +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: unused `Result` that must be used
[INFO] [stderr]    --> src/dsandalgo/linked_list/test.rs:113:13
[INFO] [stderr]     |
[INFO] [stderr] 113 |             list.pop_last();
[INFO] [stderr]     |             ^^^^^^^^^^^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]     |
[INFO] [stderr] 113 |             let _ = list.pop_last();
[INFO] [stderr]     |             +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: `rust-little-projects` (lib) generated 52 warnings (run `cargo fix --lib -p rust-little-projects` to apply 13 suggestions)
[INFO] [stderr] warning: `rust-little-projects` (lib test) generated 30 warnings (21 duplicates) (run `cargo fix --lib -p rust-little-projects --tests` to apply 5 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.05s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/rust_little_projects-526ebaccb78689d8)
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test6 ... ok
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test5 ... ok
[INFO] [stdout] test dsandalgo::isAdmissibleOverpayment::test::test::test1 ... ok
[INFO] [stdout] test dsandalgo::linked_list_disjoint_set::test::test::fuzzy_test ... ok
[INFO] [stdout] test dsandalgo::heap::test::test::fuzzy_test has been running for over 60 seconds
[INFO] [stdout] test dsandalgo::heap::test::test::fuzzy_test ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 20 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 98.36s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/main.rs (/opt/rustwide/target/debug/deps/rust_little_projects-d9c36f99749a7582)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests rust_little_projects
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "e512f56d8af9f5f7ea4e2ec7558971863b3d7e2a2bb8798302009c7cc4f78f32", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "e512f56d8af9f5f7ea4e2ec7558971863b3d7e2a2bb8798302009c7cc4f78f32", kill_on_drop: false }`
[INFO] [stdout] e512f56d8af9f5f7ea4e2ec7558971863b3d7e2a2bb8798302009c7cc4f78f32
